Design and Analysis of LT Codes with Decreasing Ripple Size

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On LT Codes with Decreasing Ripple Size

In the orignal work on LT codes by Luby, the ripple size during decoding was designed to be approximately constant. In fact, the Ideal Soliton and the Robust Soliton distributions were designed to yield an approximately unit ripple size and a fixed ripple size greater than one, respectively. In this work, the redundancy within an LT code is characterized, and it is found that a decreasing rippl...

متن کامل

Design of improved Luby transform codes with decreasing ripple size and feedback

In this study, the design of improved Luby transform codes with decreasing ripple size (LTC-DRS) with feedback is presented. Under the proposed design, a new degree distribution algorithm named generalised degree distribution algorithm (GDDA) is proposed, which can achieve arbitrary ripple size revolution accurately. On the basis of GDDA, an accurate ripple size revolution based on binomial fit...

متن کامل

LT Codes

We introduce LT codes, the first rateless erasure codes that are very efficient as the data length grows.

متن کامل

Analysis of LT Codes with Unequal Recovery Time

In this paper we analyze a specific class of rateless codes, called LT codes with unequal recovery time. These codes provide the option of prioritizing different segments of the transmitted data over other. The result is that segments are decoded in stages during the rateless transmission, where higher prioritized segments are decoded at lower overhead. Our analysis focuses on quantifying the e...

متن کامل

Capstone Project: LT Codes

Erasure codes are a type of encoding of data, generally for transmission over a lossy medium, that survive deletions (erasures) of parts of the message.1 They are especially useful for transmission of data across a medium or network that can drop packets of data, when it is impractical for the receiver to be in constant communication with the sender. Given a file with K blocks, the sender gener...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Communications

سال: 2012

ISSN: 0090-6778

DOI: 10.1109/tcomm.2012.091112.110864